Optimal Allocation of Electronic Content

نویسندگان

  • Israel Cidon
  • Shay Kutten
  • Ran Soffer
چکیده

The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of the main requirements of communication networks. This requires expensive high bandwidth capacity as well as fast and high storage servers. This motivates multimedia providers to optimize the delivery distances, as well as the electronic content allocation. A hierarchical architecture for providing the multimedia content was introduced by Nussbaumer, Patel, Schaffa, and Sternbenz (INFOCOM 94). They also introduced the trade-off between bandwidth and storage requirements for the placement of the content servers on the hierarchy tree. They found the best level of the hierarchy for the server location to minimize the total of the costs of communication and storage. Their algorithm is centralized. We solve the more general case where servers can be located at different levels of the hierarchy. Our algorithm is distributed, and each node requires a limited memory capacity and computational power. Results for related approaches to caching design are of higher complexity. Results for related classic Operations Research problems are for centralized algorithms, mostly linear programming, that are not easy to convert into distributed algorithms. Instead, we observe that the use of dynamic programming is more natural for distributed implementations. For the specific problem at hand, we also managed to find a natural function (a generalization of the problem) that simplifies the combination operation used in dynamic programming. We also show how to map such contemporary problems to the area of classical plant location problems in Operations Research.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Multiple FCLs Allocation Considering DG Penetration in Meshed Network With Multi-Level Voltages

Increasing the short circuit current due to the penetration of distributed generations (DGs) in various voltage levels and meshed topology is a basic problem in power systems. Using fault current limiter (FCL) is an efficient approach to mitigate the exceeded short circuit levels. In this paper, a new approach is presented for multiple FCLs locating to decrease short circuit levels in meshed ne...

متن کامل

Reliability Modelling of the Redundancy Allocation Problem in the Series-parallel Systems and Determining the System Optimal Parameters

Considering the increasingly high attention to quality, promoting the reliability of products during designing process has gained significant importance. In this study, we consider one of the current models of the reliability science and propose a non-linear programming model for redundancy allocation in the series-parallel systems according to the redundancy strategy and considering the assump...

متن کامل

Optimal DG Allocation and Thyristor-FCL Controlled Impedance Sizing for Smart Distribution Systems Using Genetic Algorithm

Recently, smart grids have been considered as one of the vital elements in upgrading current power systems to a system with more reliability and efficiency. Distributed generation is necessary for most of these new networks. Indeed, in all cases that DGs are used in distribution systems, protection coordination failures may occur in multiple configurations of smart grids using DGs. In different...

متن کامل

A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks

The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Networks

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2001